Majorization, doubly stochastic matrices, and comparison of eigenvalues
نویسندگان
چکیده
منابع مشابه
Doubly stochastic matrices of trees
In this paper, we obtain sharp upper and lower bounds for the smallest entries of doubly stochastic matrices of trees and characterize all extreme graphs which attain the bounds. We also present a counterexample to Merris’ conjecture on relations between the smallest entry of the doubly stochastic matrix and the algebraic connectivity of a graph in [R. Merris, Doubly stochastic graph matrices I...
متن کاملOn Stochastic Majorization of the Eigenvalues of a Wishart Matrix
In multivariate statistical analysis. orthogonally invariant sets of real positive definite pxp matrices occur as acceptance regions for tests of invariant hypotheses concerning the covariance matrix [ of a multivariate normal distribution. Equivalently. orthogonally invariant acceptance regions can be expressed in terms of the eigenvalues I, (S). .... lp(S) of a random Wishart matrix S Wp(n. [...
متن کاملRandom doubly stochastic tridiagonal matrices
Let Tn be the compact convex set of tridiagonal doubly stochastic matrices. These arise naturally in probability problems as birth and death chains with a uniform stationary distribution. We study ‘typical’ matrices T ∈ Tn chosen uniformly at random in the set Tn. A simple algorithm is presented to allow direct sampling from the uniform distribution on Tn. Using this algorithm, the elements abo...
متن کاملUncoupling Measures and Eigenvalues of Stochastic Matrices
This paper gives bounds for the uncoupling measures of a stochastic matrix P in terms of its eigenvalues. The proofs are combinatorial. We use the Matrix–Tree Theorem which represents principal minors of I−P as sums of weights of directed forests.
متن کاملVertex degrees and doubly stochastic graph matrices
In this article, the relationship between vertex degrees and entries of the doubly stochastic graph matrix has been investigated. In particular, we present an upper bound for the main diagonal entries of a doubly stochastic graphmatrix and investigate the relations between a kind of distance for graph vertices and the vertex degrees. These results are used to answer in negative Merris’ question...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1989
ISSN: 0024-3795
DOI: 10.1016/0024-3795(89)90580-6